Workshop Cycles and Colourings 2006

s 1 van Aardt S. Maximal nontraceable oriented graphs . . . . . . . . . . 1 Bača M. Total labelings of graphs . . . . . . . . . . . . . . . . . . . . 1 Bacsó G. Elementary bipartite graphs and unique colorability . . . . . 1 Borowiecki M. On F -decompositions of graphs . . . . . . . . . . . . . 2 Bujtás Cs. Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Čada R. Path factors in cubic graphs . . . . . . . . . . . . . . . . . . 3 Chen G. Finding long cycles in 3-connected graphs . . . . . . . . . . . 4 Cichacz S. Decomposition of complete bipartite graphs into trails . . . 4 Cyman J. The total outer-connected domination in trees . . . . . . . . 5 Dafik On super (a, d)-edge antimagic total labeling of disconnected graphs 5 Draženská E. The crossing numbers of graphs . . . . . . . . . . . . . . 5 Dvořák Z. k-chromatic number of graphs on surfaces . . . . . . . . . . 6 Fidytek R. On some three color Ramsey numbers for paths and cycles 6 Frick M. A new perspective on the Path partition conjecture . . . . . 6 Gould R. A look at cycles containing specified elements . . . . . . . . 7 Hajduk R. Big light graphs in some classes of polyhedra . . . . . . . . 8 Harant J. A regional version of Tutte’s Theorem concerning Hamiltonian cycles in 4-connected planar graphs . . . . . . . . . . . . . . 9 van den Heuvel J. Mixing colour(ing)s in graphs . . . . . . . . . . . . 9 Jensen T. Cycle structure and colourings . . . . . . . . . . . . . . . . 10 Kaiser T. The Dominating cycle conjecture . . . . . . . . . . . . . . . 10 Kardoš F. Symmetry of fulleroids . . . . . . . . . . . . . . . . . . . . . 11 Katrenič P. On a tree partition problem . . . . . . . . . . . . . . . . . 11 Kemnitz A. [r, s, t]-chromatic numbers of stars . . . . . . . . . . . . . 12 Kijewska M. Generalized domatic numbers of graph products . . . . . 12 Klešč M. On the crossing numbers of categorical and strong products . 13 Král’ D. Colorings of quadrangulations of the torus and the Klein bottle 13 Kravecová D. On the crossing numbers of products of power graphs . . 14 Kužel R. Trestles and walks in K1,r-free graphs . . . . . . . . . . . . . 14 Mačaj M. 2-perfect trails system, total colourings and latin squares . . 15 Máčajová E. On shortest cycle covers of cubic graphs . . . . . . . . . . 15 Matos Camacho S. Colourings of graphs with prescribed cycle lengths 15 Michalak D. k-hereditarily dominated graphs . . . . . . . . . . . . . . 16 Mihók P. Generalizations of Brooks’ Theorem a short survey . . . . . 17 Miller M. Diregularity of digraphs of out-degree three and defect two 17 Mǐskuf J. Upper bound for maximal vertex and face degree of oblique graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 Niepel L’. Dynamics of iterated path graphs . . . . . . . . . . . . . . . 18 Patyk A. Determining the diameter of a graph by the method of ”hanging” 18 Pineda-Villavicencio G. On (∆,2,2)-Graphs . . . . . . . . . . . . . . . 19 Rosa A. Cyclic Kirkman triple systems . . . . . . . . . . . . . . . . . 19 Schiermeyer I. A new upper bound for the chromatic number of a graph 20